Binomial Enumeration on Dissects
نویسندگان
چکیده
منابع مشابه
Umbral Calculus, Binomial Enumeration and Chromatic Polynomials
We develop the concept of partition categories, in order to extend the Mullin-Rota theory of binomial enumeration, and simultaneously to provide a natural setting for recent applications of the Roman-Rota umbral calculus to computations in algebraic topology. As a further application, we describe a generalisation of the chromatic polynomial of a graph. 0. Introduction. In the last 20 years, the...
متن کاملGENERALIZED BINOMIAL AND NEGATIVE BINOMIAL DISTRIBUTIONS OF ORDER k BY THE/-OVERLAPPING ENUMERATION SCHEME
A b s t r a c t . In this paper, we investigate the exact distribution of the waiting time for the r-th t-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of order k and an extended Poisson distr...
متن کاملOn harmonic binomial series
We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and calculations of theoretical physics, as well as other applications.
متن کاملSymbolization of generating functions; an application of the Mullin-Rota theory of binomial enumeration
We have found that there are more than a dozen classical generating functions that could be suitably symbolized to yield various symbolic sum formulas by employing Mullin-Rota’s theory of binomial enumeration. Various special formulas and identities involving well-known number sequences or polynomial sequences are presented as illustrative examples. The convergence of the symbolic summations is...
متن کاملObservations on Coset Enumeration
Todd and Coxeter's method for enumerating cosets of nitely generated subgroups in nitely presented groups (abbreviated by Tc here) is one famous method from combinatorial group theory for studying the subgroup problem. Since preex string rewriting is also an appropriate method to study this problem, preex string rewriting methods have been compared to Tc. We recall and compare two of them briee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1975
ISSN: 0002-9947
DOI: 10.2307/1997294